Runtime verification is analysis based on information extracted\udfrom a running system. Traditionally this involves reasoning\udabout system states, for example using trace predicates. We have been\udinvestigating runtime verification for event-driven systems and in that\udcontext we propose a higher level of abstraction can be useful, namely\udreasoning at the level of user-perceived system events. And when considering\udevents, then the natural formalism for verification is a form of\udprocess algebra.
展开▼
